The NCSU Concurrency

نویسندگان

Rance Cleaveland

Steve Sims

چکیده

The NCSU Concurrency Workbench is a tool for verifying nite-state systems. A key feature is its exibility; its modular design eases the task of adding new analyses and changing the language users employ for describing systems. This note gives an overview of the sys-tem's features, including its capacity for generating diagnostic information for incorrect systems, and discusses some of its applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey of Concurrency Control Algorithms in the Operating Systems

Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...

متن کامل

Modeling and Verifying Distributed Systems Using Priorities: a Case Study Modeling and Verifying Distributed Systems Using Priorities 1

This paper illustrates the use of priorities in process algebras by a real-world example dealing with the design of a safety-critical network which is part of a railway signaling system. Priorities in process algebras support an intuitive modeling of distributed systems since undesired inter-leavings can be suppressed. This fact also leads to a substantial reduction of the sizes of models. We h...

متن کامل

Verifying Multiparty Call in ATM UNI Signalling Protocol

This paper presents formal specification and verification of the multiparty call in ATM UNI signalling protocol. The protocol specification is written in the CCS process algebra (Calculus of Communicating Systems). Verification is done by using the NCSU-Concurrency Workbench. Due to the complexity of the protocol, the model is decomposed into three components. The protocol is verified by the mo...

متن کامل

Priorities for Modeling and Verifying Distributed Systems

This paper illustrates the use of priorities in process algebras by a real-world example dealing with the design of a safety-critical network which is part of a railway signaling system. Priorities in process algebras support an intuitive modeling of distributed systems since undesired interleavings can be suppressed. This fact also leads to a substantial reduction of the sizes of models. We ha...

متن کامل